Subject Classiication (ams)

نویسنده

  • Reinhard Strecker
چکیده

A ?semigroup is a semigroup whose lattice of congruences is a chain with respect to inclusion. Schein 9] and Tamura 11] have investigated commutative ?semigroups, Trotter 13] exponential, Nagy 4] weakly exponential and Bonzini and Cherubini Spoletini 2] nite ?semigroups. The pupose of the present paper is to investigate archimedean weakly commutative and H?commutative ?semigroups. 1 Weakly commutative semigroups The theory of congruences on semigroups is fundamental and the study of semigroups, whose lattice of congruences is simple (in some sense), is therefore relevant. Important semigroups such as the full transformation semigroup, symmetric inverse semigroups and symmetric groups, on nite sets, are all ?semigroups (see 3], vol. II, page 247 and 12], examples 1 and 2). A semigroup S is weakly commutative if, for each a; b 2 S; there are x; y 2 S and an integer k > 0 such that (ab) k = xa = by ((6]). A semigroup S is H?commutative if, for each a; b 2 S, there are w; z 2 S 1 with ab = baw = zba 14]. Remark: A H?commutative semigroup is weakly commutative. Groups are H?commuta-tive semigroups and nilsemigroups are weakly commutative.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic analysis of an elliptic-parabolic moving boundary problem

AMS Subject Classiication. We gratefully acknowledge the support of the Dutch Organisation for Scientiic Research (NWO) and the British Council.

متن کامل

Subject Classiication (ams) 65j05, 49d20 Basic Properties of Fejer Monotone Sequences Dedicated to the Professors of Mathematics

We consider certain classes of Fejer monotone sequences and their basic properties. These properties are the starting point of a convergence theory for corresponding iterative methods which are widely used to solve convex problems.

متن کامل

On Codes having Dual Distance d'>=k

Keywords: Linear codes MDS-codes AMS Subject classiication (1985) 94B05 Summary: We give several bounds for the length, dimension or minimum distance of linear block codes whose dimension equals the minimum distance of their dual codes. Zusammenfassung: Wir geben verschiedene Schranken f ur die L ange, die Dimension und den Minimalabstand linearer Blockcodes, deren Dimension gleich dem Mini-mal...

متن کامل

Large Time Behavior of Boosting

1 2 We exploit analogies between regression and classiication to study certain properties of boosting algorithms. A geometric concept called the angular span is deened and related to analogs of the VC dimension and the pseudo dimension of the regression and classiication systems, and to the assumption of the weak learner. The exponential convergence rates of boosting algorithms are shown to be ...

متن کامل

A Search Space Analysis of theJob Shop Scheduling

A computational study for the Job Shop Scheduling Problem is presented. Thereby emphasis is put on the structure of the solution space as it appears for adaptive search. A statistical analysis of the search spaces reveals the impacts of inherent properties of the problem on adaptive heuristics. Subject classiication: AMS(MOS) 90B35, 05A05.

متن کامل

Proof - Checking a Data Link

A data link protocol developed and used by Philips Electronics is modeled and veriied using I/O automata theory. Correctness is computer-checked with the Coq proof development system. AMS Subject Classiication (1991): 03B15 Mathematical logic and foundations]: Higher-order logic and type theory; 03B35 Mathematical logic and foundations]: Mechanization of proofs and logical operations; 68Q22 Com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995